A Principled, Complete, and Efficient Representation of C++
نویسندگان
چکیده
We present a systematic representation of C++, called IPR, for complete semantic analysis and semantics-based transformations. We describe the ideas and design principles that shaped the IPR. In particular, we describe how general type-based unification is key to minimal compact representation, fast type-safe traversal, and scalability. The IPR is general enough to handle real-world programs involving many translation units, archaic programming styles, and generic programming using likely C++0x extensions that affect the type system. The difficult issue of how to represent irregular (ad hoc) features in a systematic (non ad hoc) manner is among key contributions of this paper. The IPR can represent all of C++ with just slightly less than 200 node types; to compare the ISO C++ grammar has over 700 productions. Finally, we report impacts of this work on existing C++ compilers.
منابع مشابه
representation theorems of $L-$subsets and $L-$families on complete residuated lattice
In this paper, our purpose is twofold. Firstly, the tensor andresiduum operations on $L-$nested systems are introduced under thecondition of complete residuated lattice. Then we show that$L-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. Thus the new representation theorem of$L-$subsets on complete re...
متن کاملA New Dictionary Construction Method in Sparse Representation Techniques for Target Detection in Hyperspectral Imagery
Hyperspectral data in Remote Sensing which have been gathered with efficient spectral resolution (about 10 nanometer) contain a plethora of spectral bands (roughly 200 bands). Since precious information about the spectral features of target materials can be extracted from these data, they have been used exclusively in hyperspectral target detection. One of the problem associated with the detect...
متن کاملAn Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation
In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...
متن کاملA Class Library Implementation of a Principled Open Architecture Knowledge Representation Server with Plug-in Data Types
A knowledge representation server is described which provides a fast, memory-efficient and principled system component. Modeling the server through intensional algebraic semantics leads naturally to an openarchitecture class library into which new data types may be plugged in as required without change to the basic deductive engine. It is shown that the operation of an existing knowledge repres...
متن کاملRepresentation of $H$-closed monoreflections in archimedean $ell$-groups with weak unit
The category of the title is called $mathcal{W}$. This has all free objects $F(I)$ ($I$ a set). For an object class $mathcal{A}$, $Hmathcal{A}$ consists of all homomorphic images of $mathcal{A}$-objects. This note continues the study of the $H$-closed monoreflections $(mathcal{R}, r)$ (meaning $Hmathcal{R} = mathcal{R}$), about which we show ({em inter alia}): $A in mathcal{A}$ if and only if...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics in Computer Science
دوره 5 شماره
صفحات -
تاریخ انتشار 2011